Approximation theory and matrix completions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Completions of P-matrix patterns

A list of positions in an n × n real matrix (a pattern) is said to have P-completion if every partial P-matrix that specifies exactly these positions can be completed to a P-matrix. We extend work of Johnson and Kroschel [JK] by proving a larger class of patterns has Pcompletion, including any 4 × 4 pattern with eight or fewer off-diagonal positions. We also show that any pattern whose digraph ...

متن کامل

Matrix Completions , Norms and Hadamard Productsroy

Let M m;n (respectively, H n) denote the space of m n complex matrices (respectively, n n Hermitian matrices). Let S H n be a closed convex set. We obtain necessary and suucient conditions for X 0 2 S to attain the maximum in the following concave maximization problem: maxf min (A + X) : X 2 Sg where A 2 H n is a xed matrix. Let denote the Hadamard (entrywise) product, i.e., given matrices A = ...

متن کامل

fragmentability and approximation

in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...

15 صفحه اول

Derived Completions in Stable Homotopy theory

It has long been recognized that the development of a theory of ring and module spectra, which bears the same relationship to the category of spectra as the ordinary theory of rings and modules does to the category of abelian groups, is a very desirable thing. A number of such theories exist. The different approaches [12] and [15] solve the problem in a satisfactory way, and more recently (see ...

متن کامل

A Matrix and Its Inverse: Revisiting Minimal Rank Completions

We revisit a formula that connects the minimal ranks of triangular parts of a matrix and its inverse and relate the result to structured rank matrices. We also address the generic minimal rank problem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2004

ISSN: 0024-3795

DOI: 10.1016/j.laa.2003.08.005